A Levinson--Galerkin Algorithm for Regularized Trigonometric Approximation
نویسندگان
چکیده
منابع مشابه
A Levinson-Galerkin Algorithm for Regularized Trigonometric Approximation
Abstract. Trigonometric polynomials are widely used for the approximation of a smooth function f from a set of nonuniformly spaced samples {f(xj )} N−1 j=0 . If the samples are perturbed by noise, controlling the smoothness of the trigonometric approximation becomes an essential issue to avoid overfitting and underfitting of the data. Using the polynomial degree as regularization parameter we d...
متن کاملPeriodic Levinson-Durbin algorithm for entropy maximization
One gives a recursive algorithm for the computation of the first and second order derivatives of the entropy of a periodic autoregressive process with respect to the autocovariances. It is an extension of the periodic LevinsonDurbin algorithm. The algorithm has been developed for use at one of the steps of an entropy maximization method developed by the authors. Numerical examples of entropy ma...
متن کاملPeriodic Levinson-Durbin Algorithm for Entropy Maximisation
We give a recursive algorithm for the computation of the first and second order derivatives of the entropy of a periodic autoregressive process with respect to the autocovariances. It is an extentions of the periodic Levinson-Durbin algorithm. The algorithm has been developed for use at one of the steps of an entropy maximisation method developed by the authors. We give numerical examples of en...
متن کاملApproximation By Trigonometric Polynomials
These notes are prepared as lecture notes exclusively for the participants of this conference only. Any reproduction in any media, or any use for any other purpose of any part of this manuscript, without an expressed written consent of the author is unlawful.thorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conc...
متن کاملNonperiodic Trigonometric Polynomial Approximation
The most common approach for approximating non-periodic function defined on a finite interval is based on considering polynomials as basis functions. In this paper we will address the non-optimallity of polynomial approximation and suggest to switch from powers of x to powers of sin(px) where p is a parameter which depends on the dimension of the approximating subspace. The new set does not suf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2000
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827597329254